Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
نویسندگان
چکیده
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. The population-sizing model suggests that for moderate-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for single-point crossover scales as O ( 2m ) , where k is the BB size, and m is the number of BBs.
منابع مشابه
Analysis of Ideal Recombination on Random Decomposable Problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifically, additively decomposable problems of order k whose subsolution fitnesses are sampled from the standard uniform distribution U [0, 1] are analyzed. The scalability of the selectorecombinative GA is investigated for 1...
متن کاملLINKGAUGE: Tackling Hard Deceptive Problems With A New Linkage Learning Genetic Algorithm
A novel approach to obtaining a tight linkage between genes in a genetic algorithm is described, and a new system based on that approach, LINKGAUGE, is proposed. Experiments presented draw a comparison between the standard messy genetic algorithm and LINKGAUGE, and show that the latter avoids deceptive traps and early convergence, with minimal computational cost. The scalability potential of th...
متن کاملBinary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms
When using representations for genetic algorithms (GAs) every optimization problem can be separated into a genotype-phenotype and a phenotype-fitness mapping. The genotype-phenotype mapping is the used representation and the phenotype-fitness mapping is the problem that should be solved. This paper investigates how the use of different binary representations of integers influences the performan...
متن کاملThe Influence Of Binary Representations Of Integers On The Performance Of Selectorecombinative Genetic Algorithms
When using representations for genetic algorithms (GAs) every optimization problem can be separated into a genotype-phenotype and a phenotype-fitness mapping. The genotypephenotype mapping is the used representation and the phenotype-fitness mapping is the problem that should be solved. This paper investigates how the use of different binary representations of integers influences the performanc...
متن کاملDesigning Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods
This paper presents a competent selectomutative genetic algorithm (GA), that adapts linkage and solves hard problems quickly, reliably, and accurately. A probabilistic model building process is used to automatically identify key building blocks (BBs) of the search problem. The mutation operator uses the probabilistic model of linkage groups to find the best among competing building blocks. The ...
متن کامل